|
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: :''Let L be a complete lattice and let f : L → L be an order-preserving function. Then the set of fixed points of f in L is also a complete lattice.'' It was Tarski who stated the result in its most general form, and so the theorem is often known as Tarski's fixed point theorem. Some time earlier, Knaster and Tarski established the result for the special case where ''L'' is the lattice of subsets of a set, the power set lattice.〔 With A. Tarski.〕 The theorem has important applications in formal semantics of programming languages and abstract interpretation. A kind of converse of this theorem was proved by Anne C. Davis: If every order preserving function ''f : L → L'' on a lattice ''L'' has a fixed point, then ''L'' is a complete lattice. ==Consequences: least and greatest fixed points== Since complete lattices cannot be empty, the theorem in particular guarantees the existence of at least one fixed point of ''f'', and even the existence of a ''least'' (or ''greatest'') fixed point. In many practical cases, this is the most important implication of the theorem. The least fixpoint of ''f'' is the least element ''x'' such that ''f''(''x'') = ''x'', or, equivalently, such that ''f''(''x'') ≤ ''x''; the dual holds for the greatest fixpoint, the greatest element ''x'' such that ''f''(''x'') = ''x''. If ''f''(lim ''x''''n'')=lim ''f''(''x''''n'') for all ascending sequences ''x''''n'', then the least fixpoint of ''f'' is lim ''f''''n''(0) where 0 is the least element of L, thus giving a more "constructive" version of the theorem. (See: Kleene fixed-point theorem.) More generally, if ''f'' is monotonic, then the least fixpoint of ''f'' is the stationary limit of ''f''α(0), taking α over the ordinals, where ''f''α is defined by transfinite induction: ''f''α+1 = ''f'' ( ''f''α) and ''f''γ for a limit ordinal γ is the least upper bound of the ''f''β for all β ordinals less than γ. The dual theorem holds for the greatest fixpoint. For example, in theoretical computer science, least fixed points of monotone functions are used to define program semantics. Often a more specialized version of the theorem is used, where ''L'' is assumed to be the lattice of all subsets of a certain set ordered by subset inclusion. This reflects the fact that in many applications only such lattices are considered. One then usually is looking for the smallest set that has the property of being a fixed point of the function ''f''. Abstract interpretation makes ample use of the Knaster–Tarski theorem and the formulas giving the least and greatest fixpoints. Knaster–Tarski theorem can be used for a simple proof of Cantor–Bernstein–Schroeder theorem.〔Example 3 in R. Uhl, "(Tarski's Fixed Point Theorem )", from ''MathWorld''--a Wolfram Web Resource, created by Eric W. Weisstein.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Knaster–Tarski theorem」の詳細全文を読む スポンサード リンク
|